A SORTING IMPROVEMENT IN THE HEURISTIC BASED ON REMAINING AVAILABLE AND PROCESSING PERIODS TO MINIMIZE TOTAL TARDINESS IN PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING
نویسندگان
چکیده
Background. In preemptive job scheduling, which is a part of the flow-shop sequencing tasks, one most crucial goals to obtain schedule whose total tardiness would be minimal. Total minimization commonly reduced solving combinatorial problem becomes practically intractable as number jobs and numbers their processing periods increase. To cope with this challenge, heuristics are used. A heuristic, in decisive ratio reciprocal maximum pair remaining period available period, closely best one. However, heuristic may produce schedules few 25 % greater than minimum or even worse. Therefore, needs corrective branch further try minimize under certain conditions. Objective. The goal ascertain what corrected so that value could obtained lesser. will applied tight-tardy progressive idling-free 1-machine where release dates given ascending order starting from 1 jobs, due tightly set after dates. scheduling problem, inaccuracy finding minimal has strongest negative impact, almost worst case, defines accuracy limit positively serves just principle minimax guaranteeing decreasing losses Methods. sorts maximal ratios by dates, preference earliest job. achieve said goal, three other sorting approaches presented computational study carried out applying each four tardiness. For this, two series 266000 1064000 problems generated. Results. earliest-job ensures heuristically more 97.6 problems, but it fails no less 2.2 cases. Nevertheless, approach minimizing produces for any problem. If an exception occurs, “loses” very little. Moreover, exceptions quite rare been registered (out 31914 cases followed sole “win” version) achieved sorting. Conclusions. version uses periods. This, however, confirmed only case do not have priorities. when priority weights yet analyzed.
منابع مشابه
Scheduling preemptive open shops to minimize total tardiness
This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملSingle Machine Group Scheduling with Setups to Minimize Total Tardiness
This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملSingle machine scheduling with controllable processing times to minimize total tardiness and earliness
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KPI science news
سال: 2021
ISSN: ['2617-5509', '2663-7472']
DOI: https://doi.org/10.20535/kpisn.2021.1.211935